Repeated Nash implementation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Repeated Nash implementation

We study the repeated implementation of social choice functions in environments with complete information and changing preferences. We define dynamic monotonicity, a natural but nontrivial dynamic extension of Maskin monotonicity, and show that it is necessary and almost sufficient for repeated Nash implementation, regardless of whether the horizon is finite or infinite and whether the discount...

متن کامل

Imminent Nash Implementation∗

We introduce delay in simultaneous-move mechanisms. Delay is infinitesimal in equilibrium, hence the name: imminent implementation. We show that mechanisms with delay implement rules that are not implementable without delay in Nash equilibrium and its refinements. We obtain a version of the monotonicity condition that is necessary and sufficient for imminent implementability. If the domain incl...

متن کامل

Nash implementation via hyperfunctions

Hyperfunctions are social choice rules which assign sets of alternatives to preference profiles over sets. So, they are more general objects compared to standard (social choice) correspondences. Thus every correspondence can be expressed in terms of an equivalent hyperfunction. We postulate the equivalence between implementing a correspondence and its equivalent hyperfunction. We give a partial...

متن کامل

Repeated Implementation

In the traditional static implementation literature it is often impossible for implementors to enforce their optimal outcomes. And when restricting the choice to dominant-strategy implementation, only the dictatorial choices of one of the participants are implementable. Repeated implementation problems are drastically different. In this paper we provide an implementation “folk theorem”: for pat...

متن کامل

Repeated Implementation ∗

We prove that a social choice function is repeatedly implementable if and only if it is dynamically monotonic when the number of agents is at least three. We show how to test dynamic monotonicity by building an associated repeated game. It follows that a weaker version of Maskin monotonicity is necessary and sufficient among the social choice functions that are efficient. As an application, we ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Economics

سال: 2017

ISSN: 1933-6837

DOI: 10.3982/te1988